A Demonic Lattice of Information

نویسنده

  • Carroll Morgan
چکیده

Landuaer and Redmond’s Lattice of Information was an early and influential formalisation of the pure structure of security [8]: a partial order was defined for information-flow from a hidden state. In modern terms we would say that more-security refines less-security. For Landauer, the deterministic case [op. cit.], the refinement order is a lattice. Very recently [9, 3] a similar approach has been taken to purely probabilistic systems and there too a refinement order can be defined; but it is not a lattice [12]. In between deterministic and probabilistic is demonic, where behaviour is not deterministic but also not quantifiable. We show that our own earlier approach to this [15, 16] fits into the same pattern as deterministic and probabilistic, and illustrate that with results concerning compositionality, testing, soundness and completeness. Finally, we make some remarks about source-level reasoning. 1 A deterministic lattice of information — the original 1.1 Historical introduction and intuition Landauer and Redmond proposed in 1993 A Lattice of Information [8] for deterministic channels that accept hidden input and produce visible output. The “information” in Landauer’s title is what the channel’s output tells an observer about the input that we are trying to hide from her. 1 Definition 1. Deterministic channel Given non-empty input space I and output space O, a deterministic channel is a total function from I to O. For channel C: I→O, an input i in I produces an output C(i) in O. 2 With “deterministic” we emphasise that for any input i the channel C always outputs the same output o, that is o = C(i). Take for the input space I the letters {A,B,E,W}, and let the output space O be {vowel,cons} for “vowel” or “consonant”; then define channel C: I→O in the obvious way. Define another channel C: I→O whereO is {early, late} for “early” or “late” in the alphabet. These two channels C have different output spaces O (but the same input space) because they are observing different 1 We use the feminine she/her consistently for adversaries. Plural we/us is used for the designers or users of programs, or the readers of this article; and neuter “it” or plural “they” is used for third parties. things. We compare them therefore only wrt. the information they release about their inputs: the precise values of their outputs will be seen to be irrelevant. Each channel induces a partition on I via the kernels of the functions C, as shown in Fig. 1, where the partitions’ cells show just which elements of I can be distinguished by an observer who sees the output of the channel: two input elements can be distinguished by an observer just when they are not in the same cell. Thus Fig. 1(a) shows that B,W cannot be distinguished by an observer of C’s output, because they are both consonants; but Fig. 1(b) shows that B,W can be distinguished by C, because B is early but W is late.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multirelations with infinite computations

Multirelations model computations with both angelic and demonic non-determinism. We extend multirelations to represent finite and infinite computations independently. We derive an approximation order for multirelations assuming only that the endless loop is its least element and that the lattice operations are isotone. We use relations, relation algebra and RelView for representing and calculat...

متن کامل

On the design and security of a lattice-based threshold secret sharing scheme

In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...

متن کامل

Re nement and State Machine

Most SVRC technical reports are available via anonymous ftp, from svrc.it.uq.edu.au in the directory /pub/techreports. Abstracts and compressed postscript les are available via Abstract Precise module interface speciications are essential in modular software development. The role of state in these speciications has been the issue of some debate and is central to the notion of data reenement. In...

متن کامل

Demonic orders and quasi-totality in Dedekind categories

This paper presents a proof of the associativity of demonic composition of relations in Dedekind categories and shows that the demonic composition is monotonic with respect to two demonic orderings on relations, which are defined by quasi-total relations, respectively.

متن کامل

Demonic Fixed Points

We deal with a relational model for the demonic semantics of programs. The demonic semantics of a while loop is given as a fixed point of a function involving the demonic operators. This motivates us to investigate the fixed points of these functions. We give the expression of the greatest fixed point with respect to the demonic ordering (demonic inclusion) of the semantic function. We prove th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017